“Linear Multiparametric Programming by Multicriteria Simplex Method”: Errata
نویسندگان
چکیده
منابع مشابه
The (Dantzig) simplex method for linear programming
G eorge Dantzig, in describing the " Origins of the Simplex Method, " 1 noted that it was the availability of early digital computers that supported and invited the development of LP models to solve real-world problems. He agreed that invention is sometimes the mother of necessity. Moreover, he commented that he initially rejected the simplex method because it seemed intuitively more attractive...
متن کاملMultiparametric Linear and Quadratic Programming
In this work we present an algorithm for the solution of multiparametric linear and quadratic programming problems.With linear constraints and linear or convex quadratic objective functions, the optimal solution of these optimization problems is given by a conditional piecewise linear function of the varying parameters. This function results from first-order estimations of the analytical nonlin...
متن کاملMultiparametric Linear Programming with Applications to Control
Parametric programming has received a lot of attention in the control literature in the past few years because model predictive controllers (MPC) can be posed in a parametric framework and hence pre-solved offline, resulting in a significant decrease in on-line computation effort. In this paper we survey recent work on parametric linear programming (pLP) from the point of view of the control en...
متن کاملLinear Model Predictive Control via Multiparametric Programming
Linear systems with input, output, or state constraints are probably themost important class of systems in practice and the most studied as well. Although, a variety of control design methods have been developed for linear systems, it is widely accepted that stability and good performance for these systems, especially in the presence of constraints, is guaranteed with a nonlinear control law. T...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1977
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.24.2.238